An Ant Colony Optimization Algorithm for the 2D HP Protein Folding Problem
نویسندگان
چکیده
منابع مشابه
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein’s structure from its amino-acid sequence is one of the most important problems in computational biology. In the current work, we focus on a widely studied abstraction of this problem, the 2-dimensional hydrophobic-polar (2D HP) protein folding problem. We present an improved version of our recently proposed Ant Colony Optimisation (ACO) algorithm for this -hard combi...
متن کاملCompetitive Imperialistic Approach for Protein Folding
The protein folding problem is a fundamental problem in computational molecular biology and biochemical physics which led us to understand the function of a given sequence.The problem is NP-hard and the standard computational approach are not suitable to obtain the enough accurate structure in the huge conformation space. Simplied models such as hydrophobicpolar (HP) model have become one of th...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملAco-metaheuristic for 3d-hp Protein Folding Optimization
Protein Folding is a broad research field in computational Biology, Molecular Biology and Bioinformatics. Protein Folding Optimization is one of the NP-hard problems. Bio-inspired metaheuristics plays a major role in solving the protein folding optimization which can mimic the insect’s problem solving abilities like foraging, nest building and mating. In this paper Ant Colony Optimization (ACO)...
متن کاملA Hybrid Population based ACO Algorithm for Protein Folding
A hybrid population based Ant Colony Optimization (ACO) algorithm PFold-P-ACO for protein folding in the HP model is proposed in this paper. This is the first population based ACO algorithm in the bioinformatics. It is shown experimentally that the algorithms achieves on nearly all test sequences at least comparable results to other state of the art algorithms. Compared to the state of the art ...
متن کامل